Combining Multisets with Integers
نویسنده
چکیده
منابع مشابه
Fuzzy Measures and Comonotonicity on Multisets
Fuzzy measures on multisets are studied. We show that a class of multisets can be represented as a subset of positive integers. Comonotonicity for multisets are defined. We show that a fuzzy measure on multisets with some comonotonicity condition can be represented by generalized fuzzy integral.
متن کاملDenumerations of rooted trees and multisets
R\I stands for the set of positive integers, and li$, for the set of non-negative integers. If S is a set then IS( is the number of elements of S. If S is a set, then a multiset of elements of S is a mapping f of S into &, with the property that the set of s with f(s)>0 is finite. The set of all these multisets is denoted M(S). Some of our multisets are multisets of natural numbers. Number theo...
متن کاملAsymptotic enumeration and logical limit laws for expansive multisets and selections
Given a sequence of integers aj, j ≥ 1, a multiset is a combinatorial object composed of unordered components, such that there are exactly aj one-component multisets of size j. When aj ≍ jr−1yj for some r > 0, y ≥ 1, then the multiset is called expansive. Let cn be the number of multisets of total size n. Using a probabilistic approach, we prove for expansive multisets that cn/cn+1 → 1 and that...
متن کاملMUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multisets, and integers. Constraints over collections and integers are connected using the cardinality operator. Our logic is a fragment of logics of popular interactive theorem provers, and MUNCH is the first fully automa...
متن کاملAn Erdös-Ko-Rado theorem for multisets
Let k and m be positive integers. A collection of k-multisets from {1, . . . ,m} is intersecting if every pair of multisets from the collection is intersecting. We prove that for m ≥ k +1, the size of the largest such collection is ( m+k−2 k−1 ) and that when m > k + 1, only a collection of all the k-multisets containing a fixed element will attain this bound. The size and structure of the larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002